Optimization Rules for Programming with Collective Operations
نویسندگان
چکیده
We study how several collective operations like broadcast, reduction, scan, etc. can be composed efficiently in complex parallel programs. Our specific contributions are: (1) a formal framework for reasoning about collective operations; (2) a set of optimization rules which save communications by fusing several collective operations into one; (3) performance estimates, which guide the application of optimization rules depending on the machine characteristics; (4) a simple case study with machine experiments.
منابع مشابه
Development of a goal programming model for optimization of truck allocation in open pit mines
Truck and shovel operations comprise approximately 60% of the total operating costs in open pit mines. In order to increase productivity and reduce the cost of mining operations, it is essential to manage the equipment used with high efficiency. In this work, the chance-constrained goal programing (CCGP) model presented by Michalakopoulos and Panagiotou is developed to determine an optimal truc...
متن کاملA Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations
In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
متن کاملPipelining and Overlapping for MPI Collective Operations
Collective operations are an important aspect of the currently most important message-passing programming model MPI (Message Passing Interface). Many MPI applications make heavy use of collective operations. Collective operations involve the active participation of a known group of processes and are usually implemented on top of MPI point-to-point message passing. Many optimizations of the used...
متن کاملFlow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کاملMedium Term Hydroelectric Production Planning - A Multistage Stochastic Optimization Model
Multistage stochastic programming is a key technology for making decisions over time in an uncertain environment. One of the promising areas in which this technology is implementable, is medium term planning of electricity production and trading where decision makers are typically faced with uncertain parameters (such as future demands and market prices) that can be described by stochastic proc...
متن کامل